Linear-Time Text Compression by Longest-First Substitution
نویسندگان
چکیده
منابع مشابه
Linear-Time Off-Line Text Compression by Longest-First Substitution
Given a text, grammar-based compression is to construct a grammar that generates the text. There are many kinds of text compression techniques of this type. Each compression scheme is categorized as being either off-line or on-line, according to how a text is processed. One representative tactics for off-line compression is to substitute the longest repeated factors of a text with a production ...
متن کاملLinear-Time Text Compression by Longest-First Substitution
We consider grammar-based text compression with longest first substitution (LFS), where non-overlapping occurrences of a longest repeating factor of the input text are replaced by a new non-terminal symbol. We present the first linear-time algorithm for LFS. Our algorithm employs a new data structure called sparse lazy suffix trees. We also deal with a more sophisticated version of LFS, called ...
متن کاملLongest Fragment First Algorithms for Data Compression
On{line text{compression algorithms are considered, where compression is done by substituting substrings of the text according to some xed dictionary (code book). Due to the long running time of optimal compression algorithms, several on{line heuristics have been introduced in the literature. In this paper we analyse two modied version of an old algorithm introduced by Shuegraf and Heaps [8]. W...
متن کاملFirst order linear fuzzy dynamic equations on time scales
In this paper, we study the concept of generalized differentiability for fuzzy-valued functions on time scales. Usingthe derivative of the product of two functions, we provide solutions to first order linear fuzzy dynamic equations. Wepresent some examples to illustrate our results.
متن کاملComputing Longest Previous Factor in linear time and applications
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of the longest factor of w starting at position i that occurs previously in w. Several properties and applications of LPF are investigated. They include computing the Lempel-Ziv factorization of a string and detecting all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2009
ISSN: 1999-4893
DOI: 10.3390/a2041429